Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
نویسندگان
چکیده
منابع مشابه
Tight Bounds on the Minimum Euclidean Distance for Block Coded Phase Shift Keying
We present upper and lower bounds on the minimum Euclidean distance dEmin(C) for block coded PSK. The upper bound is an analytic expression depending on the alphabet size q, the block length n and the number of codewords jCj of the code C. This bound is valid for all block codes with q 4 and with medium or high rate codes where jCj > (q=3). The lower bound is valid for Gray coded binary codes o...
متن کاملInner-Distance SC (IDSC) by replacing the Euclidean distance
In this paper, we propose a novel contour-based shape descriptor, named Multiscale Distance Matrix (MDM), to capture shape geometry while being invariant to translation, rotation, scaling, and bilateral symmetry. The descriptor is further combined with dimensionality reduction to improve its discriminative power. The proposed method avoids the time-consuming point-wise matching used in most of ...
متن کاملLower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملUpper bounds on the minimum distance of spherical codes
We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n, s) are introduced with the property that Qj(n, s) < 0 for some j > m iff the Levenshtein bound Lm(n, s) on A(n, s) = max{|W | : W is an (n, |W |, s) code} can be improved by a polynomial of degree at least m+1. General conditions on t...
متن کاملBounds for the minimum distance in constacyclic codes
In algebraic coding theory it is common practice to require that (n, q) = 1, where n is the word length and F = GF(q) is the alphabet. In this paper, which is about constacyclic codes, we shall stick to this practice too. Since linear codes have the structure of linear subspaces of F , an alternative description of constacyclic codes in terms of linear algebra appears to be another quite natura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.04.025